Hybridization of Evolutionary and Swarm Intelligence Techniques for Job Scheduling Problem
نویسنده
چکیده
For more than a decade, scheduling of jobs has been an attractive research subject for researchers. There are several different ways to schedule jobs, and the threads which make them up. As well, the job scheduling is one of the active research fields, where the researchers work to enhance the efficiency of the job scheduling process in a scheduling environment. In existing hybrid techniques, some efficient factors related to jobs like turnaround time, job execution time and more have not been considered in the job scheduling process. The main drawback is lack of factors in the scheduling process which reduces the performance. To overcome such drawback in the existing methods, an adaptive ABC technique is proposed. In this proposed adaptive ABC technique, the term adaptiveness is achieved by using mutation, crossover and velocity in the employed bee phase for finding the new food sources. The adaptive ABC algorithm optimally allocates the jobs to the accurate processors or resources. Moreover, these existing techniques mostly concentrate on two major factors such as the minimization of the makespan and the completion time. The adaptiveness improves the efficiency of scheduling process when compared to the two conventional hybrid job scheduling techniques. The experimental result shows the performance of the proposed job scheduling process.
منابع مشابه
An Effective Hybrid Particle Swarm Optimization for Flexible Job Shop Scheduling Problem
The job shop scheduling problem is one of the most arduous combinatorial optimization problems. Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. This paper proposed a new effective approach based on the hybridization of the particle swarm optimization (PSO) an...
متن کاملComparison of Three Evolutionary Algorithms: GA, PSO, and DE
This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The gener...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملOptimal Grid Scheduling Using Improved Artificial Bee Colony Algorithm
Job Scheduling plays an important role for efficient utilization of grid resources available across different domains and geographical zones. Scheduling of jobs is challenging and NPcomplete. Evolutionary / Swarm Intelligence algorithms have been extensively used to address the NP problem in grid scheduling. Artificial Bee Colony (ABC) has been proposed for optimization problems based on foragi...
متن کاملAn effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems
Scheduling for the flexible job-shop is very important in both fields of production management and combinatorial optimization. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. Particle swa...
متن کامل